for tests in range(int(input())):
n=int(input());AA=[(1,i) for i in range((n+2)//2,n)] + [(i,n) for i in range((n+2)//2-1,0,-1)];L=list(range(1,n+1));sc=0
for x,y in AA[::-1]:L[x-1],L[y-1]=L[y-1],L[x-1];sc+=(x-y)**2
print(sc);print(*L);print(len(AA))
for x,y in AA:print(y,x) if L[x-1]==y else print(x,y);L[x-1],L[y-1]=L[y-1],L[x-1]
1547C - Pair Programming | 550A - Two Substrings |
797B - Odd sum | 1093A - Dice Rolling |
1360B - Honest Coach | 1399C - Boats Competition |
1609C - Complex Market Analysis | 1657E - Star MST |
1143B - Nirvana | 1285A - Mezo Playing Zoma |
919B - Perfect Number | 894A - QAQ |
1551A - Polycarp and Coins | 313A - Ilya and Bank Account |
1469A - Regular Bracket Sequence | 919C - Seat Arrangements |
1634A - Reverse and Concatenate | 1619C - Wrong Addition |
1437A - Marketing Scheme | 1473B - String LCM |
1374A - Required Remainder | 1265E - Beautiful Mirrors |
1296A - Array with Odd Sum | 1385A - Three Pairwise Maximums |
911A - Nearest Minimums | 102B - Sum of Digits |
707A - Brain's Photos | 1331B - Limericks |
305B - Continued Fractions | 1165B - Polycarp Training |